Enumerating Satisfiable Propositional FormulCB
نویسندگان
چکیده
It is known experimentally that there is a threshold for satisfiability in 3-CNF formulre around the value 4.25 for the ratio of variables to clauses. It is also known that the threshold is sharp [Fri99], but that proof does not give a value for the threshold. We use purely combinatorial techniques to count the number of satisfiable boolean formulre given in conjunctive normal form. The intention is to provide information about the relative frequency of boolean functions with respect to statements of a given size, and to give a closed-form formula for any number of variables, literals and clauses. We describe a correspondence between the syntax of propositions to the semantics of functions using a system of equations and show how to solve such a system.
منابع مشابه
A new proof of the compactness theorem for propositional logic
The compactness theorem for propositional logic states that a demumerable set of propositional formulas is satisfiable if every finite subset is satisfiable. Though there are many different proofs, the underlying combinatorial basis of most of them seems to be Kόnig's lemma on infinite trees (see Smullyan [2], Thomson [3]). We base our proof on a different combinatorial lemma due to R. Rado [1]...
متن کاملUsing Defeasible Information to Obtain Coherence
We consider the problem of obtaining coherence in a propositional knowledge base using techniques from Belief Change. Our motivation comes from the field of formal ontologies where coherence is interpreted to mean that a concept name has to be satisfiable. In the propositional case we consider here, this translates to a propositional formula being satisfiable. We define belief change operators ...
متن کاملExact Selection of Minimal Unsatisfiable Subformulae for Special Classes of Propositional Formulae
A minimal unsatisfiable subformula (MUS) of a given propositional formula is a subset of clauses which is unsatisfiable, but becomes satisfiable as soon as we remove any of its clauses. In several applicative fields, a relevant problem besides solving the satisfiability problem, is to detect a minimal unsatisfiable subformula. This is expecially true when the application is encoded into a propo...
متن کاملDesign and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
We propose a method of constructing concurrent programs in which the synchronization skeleton of the program ~s automatically synthesized from a high-level (branching time) Temporal Logic specification. The synchronization skeleton is an abstraction of the actual program where detail irrelevant to synchronization is suppressed. For example, in the synchronization skeleton for a solution to the ...
متن کاملOptimising Propositional Modal Satisfiability for Description Logic Subsumption
Effective optimisation techniques can make a dramatic difference in the performance of knowledge representation systems based on expressive description logics. Because of the correspondence between description logics and propositional modal logic many of these techniques carry over into propositional modal logic satisfiability checking. Currently-implemented representation systems that employ t...
متن کامل